On an extremal problem concerning the interval number of a graph
نویسندگان
چکیده
منابع مشابه
Extremal values of the interval number of a graph, II
The interval number i(G) of a simple graph G is the smallest number such that to each vertex in G there can be assigned a collection of at most finite closed intervals on the real line so that there is an edge between vertices v and w in G if and only if some interval for v intersects some interval for w. The well known interval graphs are precisely those graphs G with i(G)=<I. We prove here th...
متن کاملOn an Extremal Problem concerning Primitive Sequences
A sequence a,< . . . of integers is called primitive if no a divides any other . (a 1 < . . . will always denote a primitive sequence .) It is easy to see that if a i < . . . < a,,, < n then max k = [(n + 1) /2] . The following question seems to be very much more difficult . Put f(n) =niax E 1) , a,, where the maximum is taken over all primitive sequences all of wliose terms are not exceeding n...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملOn a problem in extremal graph theory
The number T*(n, k) is the least positive integer such that every graph with n = (*:I) + t vertices (t > 0) and at least T*(n, k) edges contains k mutually vertex-disjoint complete subgraphs S, , S, ,..., Sk where S, has ivertices, I < i Q k. Obviously T*(n, k) > T(n, k), the Turan number of edges for a Ki . It is shown that if n > gkk” then equality holds and that there is c :0 such that for (...
متن کاملOn a conjecture concerning the orientation number of a graph
For a connected graph G containing no bridges, let D(G) be the family of strong orientations of G; and for any D ∈ D(G), we denote by d(D) the diameter of D. The orientation number −→ d (G) of G is defined by −→ d (G) = min{d(D)|D ∈ D(G)}. Let G(p, q;m) denote the family of simple graphs obtained from the disjoint union of two complete graphs K p and Kq by adding m edges linking them in an arbi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1986
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90002-8